Portfolio approaches in constraint programming

Evaluation and Application of Portfolio Approaches in Constraint Programming

Recent research in areas such as SAT solving and Integer Linear Programming has shown that the performances of a single arbitrarily efficient solver can be significantly outperformed by a portfolio of possibly slower on-average solvers. My research proposal is to explore and assess the benefits that the use of portfolios could have for CSPs by trying to integrate existing approaches with new te...

An Extensive Evaluation of Portfolio Approaches for Constraint Satisfaction Problems

Modeling the Portfolio Selection Problem with Constraint Programming

Portfolio selection is a relevant problem in finance and economics. It consists in selecting a portfolio of assets considering a given expected return such that the risk of the portfolio is minimized. Several approaches have been proposed to tackle this problem, which are mainly based on mathematical programming techniques and metaheuristics. In this paper we illustrate how this problem can eas...

Ilp and Constraint Programming Approaches to a Template Design Problem

We describe a design problem arising in the colour printing industry and discuss a number of integer linear programming and constraint programming approaches to its solution. Despite the apparent simplicity of the problem it presents a challenge for both approaches. We present results for three typical cases and show that the constraint programming approach provides better results , although in...

1 Constraint Programming in Constraint

1.1 Abstract We view constraints as relations and constraint satisfaction as a dynamic process of approaching the solution set of the constraints. We have developed a semantic model for dynamic systems, called Constraint Nets, to provide a real-time programming semantics and to model and analyze dynamic systems. In this paper, we explore the relationship between constraint satisfaction and cons...